Photoplethysmography Data Reduction Using Truncated Singular Value Decomposition and Internet of Things Computing

نویسندگان

چکیده

Biometric-based identity authentication is integral to modern-day technologies. From smart phones, personal computers, and tablets security checkpoints, they all utilize a form of check based on methods such as face recognition fingerprint-verification. Photoplethysmography (PPG) another biometric-based that has recently been gaining momentum, because it effective easy implement. This paper considers cloud-based system model for PPG-authentication, where the PPG signals various individuals are collected with distributed sensors communicated cloud authentication. Such incursarge signal traffic, especially in crowded places airport checkpoints. motivates need compression–decompression scheme (or Codec short). The required reduce data traffic by compressing each before communicated, i.e., encoding right after comes off sensor sent be reconstructed (i.e., decoded). Therefore, two requirements meet: (i) produce high-fidelity reconstruction; (ii) have computationallyightweight encoder. Both met proposed this paper, which designed using truncated singular value decomposition (T-SVD). developed tested publicly available dataset from multiple individuals, namely CapnoBase dataset. It shown achieve 95% compression ratio 99% coefficient determination. means capable delivering first requirement, reconstruction, while producing highly compressed signals. Those do not require heavy computations produced well. An implementation single-board computer attempted encoder, showing encoder can average 300 milliseconds per Raspberry Pi 3. enough time encode prior transmission cloud.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the truncated multilinear singular value decomposition

In this report, we investigate the truncated multilinear singular value decomposition (MLSVD), proposed in De Lathauwer et al. (2000). Truncating the MLSVD results in an approximation, with a prescribed multilinear rank, to a tensor. We present a new error expression for an approximate Tucker decomposition with orthogonal factor matrices. From this expression, new insights are obtained which le...

متن کامل

More Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition

Bidiagonal reduction is the preliminary stage for the fastest stable algorithms for computing the singular value decomposition. However, the best error bounds on bidiagonal reduction methods are of the form A + A = UBV T ; kAk 2 " M f(n)kAk 2 where B is bidiagonal, U and V are orthogonal, " M is machine precision, and f(n) is a modestly growing function of the dimensions of A. A Givens-based bi...

متن کامل

پیشنهاد روش جدیدی برای محاسبه polynomial singular value decomposition ) psvd )

در این پایان نامه به معرفی روشهای مختلف محاسبه psvd می پردازیم. بخشی از این روشها به بررسی روشهای مختلف محاسبه psvd در مقالات مطالعه شده می پردازد که می توان به محاسبهpsvd با استفاده از الگوریتمهای pqrd و pevd و sbr2 و محاسبه psvd براساس تکنیک kogbetliantz و روش پارامتریک برای محاسبه psvd اشاره نمود. بخش بعدی نیز به بررسی روشهای مستقیم پیشنهادی محاسبه psvd برای ماتریسهای 2×2و2× n و n×2 و 3× n و...

15 صفحه اول

On the Statistical Meaning of Truncated Singular Value Decomposition

Empirical data collected in practice usually are not exact. For various reasons it is often suggested in many applications to replace the original data matrix by some lower dimensional representation obtained via subspace approximation or truncation. The truncated singular value decomposition, for example, is one of the most commonly used representations. This note attempts to shed some light o...

متن کامل

Computing the Generalized Singular Value Decomposition

We present a variation of Paige's algorithm for computing the generalized singular value decomposition (GSVD) of two matrices A and B. There are two innovations. The rst is a new preprocessing step which reduces A and B to upper triangular forms satisfying certain rank conditions. The second is a new 2 by 2 triangular GSVD algorithm, which constitutes the inner loop of Paige's algorithm. We pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12010220